Algorithms for Message Authentication Codes Based on Generalized Cellular Automata
نویسندگان
چکیده
منابع مشابه
Cellular Automata Based Authentication (CAA)
Current demands for secured communication have focussed intensive interest on ‘Authentication’. There is a great demand for a highspeed low cost scheme for generation of Message Authentication Code (MAC). This paper introduces a new computational model built around a special class of Cellular Automata (CA) that can be employed for both message and image authentication. Cryptanalysis of the prop...
متن کاملAggregate Message Authentication Codes
We propose and investigate the notion of aggregate message authentication codes (MACs) which have the property that multiple MAC tags, computed by (possibly) different senders on multiple (possibly different) messages, can be aggregated into a shorter tag that can still be verified by a recipient who shares a distinct key with each sender. We suggest aggregate MACs as an appropriate tool for au...
متن کاملQuantum message authentication codes
I describe protocols which assure the recipient of a quantum state that it has come from a sender with whom he has previously shared secret key. Their security is information-theoretic (“unconditional”) rather than based on computational assumptions. A particular class of such protocols is constructed, for which the different keys correspond to different, secret, quantum error detecting codes. ...
متن کاملAlgebraic Message Authentication Codes
This paper suggests a message authentication scheme, which can be efficiently used for secure digital signature creation. The algorithm used here is an adjusted union of the concepts which underlie projective geometry and group structure on circles. The authentication is done through a key, which iterates over the complete message string to produce the signature. The iteration is not only based...
متن کاملDifferential Attack on Message Authentication Codes
We discuss the security of Message Authentication Code (MAC) schemes from the viewpoint of differential attack, and propose an attack that is effective against DES-MAC and FEAL-MAC. The attack derives the secret authentication key in the chosen plaintext scenario. For example, DES(8-round)-MAC can be broken with 2 pairs of plaintext, while FEAL8-MAC can be broken with 2 pairs. The proposed atta...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science and Education of the Bauman MSTU
سال: 2016
ISSN: 1994-0408
DOI: 10.7463/1116.0849590